A Quaternion Firefly Algorithm to Solve a Multi-row Facility Layout Problem (RESEARCH NOTE)

Authors

Abstract:

In this paper, a quaternion firefly algorithm is utilized to solve a multi-row facility layout design problem with the objective of minimizing the total cost of transportation. A quaternion firefly algorithm takes the motion of the firefly as a quaternion one. Consequently, the solution space is explored more accurately and the answers are of higher quality. That is, the answers are considerably better than those obtained by standard firefly algorithms. Given the necessity to cut the costs of transferring materials in the facility layout design, a layout is adopted to examine the performance of the algorithm and the solutions from the proposed algorithm are compared with those of CRAFT software, entropy algorithm, and genetic algorithm with that of a heuristic process. The results show better performance of the proposed algorithm comparing other algorithms under examination.  

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

A Hybrid Simulated Annealing algorithm for Single Row Facility Layout Problem

This article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. Regarding the NP-Hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. A number of test problems are randomly generat...

full text

A polyhedral approach to the single row facility layout problem

The Single Row Facility Layout Problem (SRFLP) is the NP -hard problem of arranging facilities on a line, while minimizing a weighted sum of the distances between facility pairs. In this paper, a detailed polyhedral study of the SRFLP is performed, and several huge classes of valid and facet-inducing inequalities are derived. Some separation heuristics are presented, along with a primal heurist...

full text

a hybrid simulated annealing algorithm for single row facility layout problem

this article addresses a single row facility layout problem where the objective is to optimize the arrangement of some rectangular facilities with different dimensions on a line. regarding the np-hard nature of the considered problem, a hybrid meta-heuristic algorithm based on simulated annealing has been proposed to obtain a near optimal solution. a number of test problems are randomly generat...

full text

Cutting-Plane Separation Strategies for Semidefinite Programming Models to Solve the Single-Row Facility Layout Problem

The single-row facility layout problem (SRFLP) is concerned with finding the optimal linear placement of n departments with different lengths in a straight line. It is typically achieved by minimizing the cost associated with the interactions between the departments. The semidefinite programming (SDP) relaxation model that incorporates cutting planes proposed recently by Anjos, Kennings, and Va...

full text

Firefly Algorithm to Solve a Project Scheduling Problem

This paper describes the Software Project Scheduling Problem (SPSP) as a combinatorial optimization problem. In this problem raises the need for a process to assign a set of resources to tasks for a project in a given time, trying to decrease the duration and cost. The workers are the main resource in the project. We present the design of the resolution model to solve the SPSP using an algorith...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 28  issue 11

pages  1605- 1613

publication date 2015-11-01

By following a journal you will be notified via email when a new issue of this journal is published.

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023